Uniform approximations of discrete-time filters
نویسندگان
چکیده
منابع مشابه
Rates for Branching Particle Approximations of Continuous - Discrete Filters
Herein, we analyze an efficient branching particle method for asymptotic solutions to a class of continuous-discrete filtering problems. Suppose that t→Xt is a Markov process and we wish to calculate the measure-valued process t→ μt(·) . = P{Xt ∈ ·|σ{Ytk , tk ≤ t}}, where tk = kε and Ytk is a distorted, corrupted, partial observation of Xtk . Then, one constructs a particle system with observat...
متن کاملMinimax Robust Discrete-Time Matched Filters
The problem of designing finite-length discrete-time matched filters is considered for situations in which exact knowledge of the input signal and/or noise characteristics is not available. Such situations arise in many applications due to channel distortion, incoherencies, nonlinear effects, and other modeling uncertainties. In such cases it is often of interest to design a minimax robust matc...
متن کامل9 Uniform Time Average Consistency of Monte Carlo Particle Filters
We prove that bootstrap type Monte Carlo particle filters approximate the optimal nonlinear filter in a time average sense uniformly with respect to the time horizon when the signal is ergodic and the particle system satisfies a tightness property. The latter is satisfied without further assumptions when the signal state space is compact, as well as in the noncompact setting when the signal is ...
متن کاملApproximations of General Discrete Time Queues by Discrete Time Queues with Arrivals Modulated by Finite Chains
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...
متن کاملFault-tolerant discrete-time linear time-invariant filters
Modular redundancy, the traditional approach to fault tolerance, is prohibitively expensive because of the overhead in replicating the hardware. In this paper we discuss alternative methods for obtaining fault-tolerant architectures for discrete-time (DT) linear time-invariant (LTI) filters. We view such filters as dynamic systems and provide fault tolerance to them by embedding their state int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 2008
ISSN: 0001-8678,1475-6064
DOI: 10.1239/aap/1231340161